Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(X) |
→ if(X,c,f(true)) |
| 2: |
|
if(true,X,Y) |
→ X |
| 3: |
|
if(false,X,Y) |
→ Y |
|
There are 2 dependency pairs:
|
| 4: |
|
F(X) |
→ IF(X,c,f(true)) |
| 5: |
|
F(X) |
→ F(true) |
|
The approximated dependency graph contains one SCC:
{5}.
-
Consider the SCC {5}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006